On the Capacity of Indecomposable Finite-State Channels With Feedback

A lower bound on the feedback capacity of finite-state ISI channels

By assuming a Markov-memory input process, we construct a Monte Carlo method for computing a lower bound on the feedback capacity of finite-state inter-symbol interference (ISI) channels. The transition probabilities of the Markov process are allowed to depend on previous observations of the channel outputs, where a suboptimal feedback strategy is chosen to implement the feedback. Generally, th...

Capacity-Achieving Schemes for Finite-State Channels

Capacity-Achieving Schemes for Finite-State Channels

Capacity of Finite State Markov Channels with General Inputs

We study new formulae based on Lyapunov exponents for entropy, mutual information, and capacity of finite state discrete time Markov channels. We also develop a method for directly computing mutual information and entropy using continuous state space Markov chains. Our methods allow for arbitrary input processes and channel dynamics, provided both have finite memory. We show that the entropy ra...

The Zero-Error Feedback Capacity of State-Dependent Channels

The zero-error feedback capacity of the Gelfand-Pinsker channel is established. It can be positive even if the channel’s zero-error capacity is zero in the absence of feedback. Moreover, the error-free transmission of a single bit may require more than one channel use. These phenomena do not occur when the state is revealed to the transmitter causally, a case that is solved here using Shannon s...

On Channels with Finite Holevo Capacity